Lacunary Polynomials over Finite Fields Course notes
نویسنده
چکیده
This is a summary of the course Lacunary Polynomials over Finite Fields, given by Simeon Ball, from the University of London, in March 5-8, 2002, at the Universitat Politècnica de Catalunya (Barcelona). Explanations of Dr. Ball have been complemented with some results of [3] and [4].
منابع مشابه
Combinatorial Problems in Finite Geometry and Lacunary Polynomials
We describe some combinatorial problems in finite projective planes and indicate how Rédei’s theory of lacunary polynomials can be applied to them. 2000 Mathematics Subject Classification: 05.
متن کاملComputing the multilinear factors of lacunary polynomials without heights
We present a deterministic polynomial-time algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. It is based on a new Gap theorem which allows to test whether P(X) = ∑j=1 ajX j(vX+ t) j(uX+ w)j is identically zero in polynomial time. Previous algorithms for this task were based on Gap Theorems expressed in terms of the height of the coefficien...
متن کاملThe Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
A unified treatment of parameters relevant to factoring polynomials over finite fields is given. The framework is based on generating functions for describing parameters of interest and on singularity analysis for extracting asymptotic values. An outcome is a complete analysis of the standard polynomial factorization chain that is based on elimination of repeated factors, distinct degree factor...
متن کاملBounded-degree factors of lacunary multivariate polynomials
In this paper, we present a new method for computing boundeddegree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in lacunary representation and a degree bound d and computes the irreducible factors of degree at most d of f in time polynomial in the lacunary size of f and in ...
متن کاملPolynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank 2 Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from Euler-Poincare characteristics of random Drinfeld modules. Knowledge of a factor degree allows one to rapidly extract all factors of that degree. As a consequence, the...
متن کامل